Solving Linear Integer Arithmetic
نویسندگان
چکیده
We describe a new algorithm for solving linear integer programming problems. The algorithm performs a DPLL style search for a feasible assignment, while using a novel cut procedure to guide the search away from the conflicting states.
منابع مشابه
On the Satisfiability of Modular Arithmetic Formula
Modular arithmetic is the underlying integer computation model in conventional programming languages. In this paper, we discuss the satisfiability problem of modular arithmetic formulae over the finite ring Z2ω . Although an upper bound of 2 2 4) can be obtained by solving alternation-free Presburger arithmetic, it is easy to see that the problem is in fact NP-complete. Further, we give an effi...
متن کاملOn the Satisfiability of Modular Arithmetic Formulae
Modular arithmetic is the underlying integral computation model in conventional programming languages. In this paper, we discuss the satisfiability problem of propositional formulae in modular arithmetic over the finite ring Z2ω . Although an upper bound of 2 2 O(n4) can be obtained by solving alternation-free Presburger arithmetic, it is easy to see that the problem is in fact NP-complete. Fur...
متن کاملEncoding Basic Arithmetic Operations for SAT-Solvers
In this paper we start an investigation to check the best we can do with SAT encodings for solving two important hard arithmetic problems, integer factorization and discrete logarithm. Given the current success of using SAT encodings for solving problems with linear arithmetic constraints, studying the suitability of SAT for solving non-linear arithmetic problems was a natural step. However, ou...
متن کاملCutting to the Chase Solving Linear Integer Arithmetic
We describe a new algorithm for solving linear integer programming problems. The algorithm performs a DPLL style search for a feasible assignment, while using a novel cut procedure to guide the search away from the conflicting states.
متن کاملCertified Diophantine Solving of Linear Systems in LinBox
LinBox[6] is a C++ template library for high-performance exact linear algebra. It provides optimized facilities for solving rational systems, and computing invariants and canonical forms of linear operators. It acts as middleware on top of existing low-level software libraries for multiprecision integer arithmetic (GMP, NTL), finite field algebra (Givaro, NTL) and linear algebra (BLAS, ATLAS). ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013